111![The Computational Complexity of Linear Optics The Computational Complexity of Linear Optics](https://www.pdfsearch.io/img/c4570d6d10fc66bb15444efa3edd8ba4.jpg) | Add to Reading ListSource URL: theoryofcomputing.orgLanguage: English - Date: 2013-02-09 04:40:42
|
---|
112![Radio Network Clustering from Scratch Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer {kuhn,moscitho,wattenhofer}@inf.ethz.ch Department of Computer Science, ETH Zurich, 8092 Zurich, Switzerland Abstract. We propose a Radio Network Clustering from Scratch Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer {kuhn,moscitho,wattenhofer}@inf.ethz.ch Department of Computer Science, ETH Zurich, 8092 Zurich, Switzerland Abstract. We propose a](https://www.pdfsearch.io/img/b80d2ca4010c8e17aa6ecaf38b3dbbf7.jpg) | Add to Reading ListSource URL: distcomp.ethz.chLanguage: English - Date: 2004-06-25 07:00:09
|
---|
113![Efficient Adaptive Collect using Randomization Hagit Attiya1 , Fabian Kuhn2 , Mirjam Wattenhofer2 , and Roger Wattenhofer2 1 2 Department of Computer Science, Technion Efficient Adaptive Collect using Randomization Hagit Attiya1 , Fabian Kuhn2 , Mirjam Wattenhofer2 , and Roger Wattenhofer2 1 2 Department of Computer Science, Technion](https://www.pdfsearch.io/img/3d0ca570f6aebec0232a9a1ec1a7f430.jpg) | Add to Reading ListSource URL: distcomp.ethz.chLanguage: English - Date: 2004-08-13 15:01:47
|
---|
114![Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs Fabian Kuhn1 , Thomas Moscibroda1 , Tim Nieberg2? , and Roger Wattenhofer1 1 Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs Fabian Kuhn1 , Thomas Moscibroda1 , Tim Nieberg2? , and Roger Wattenhofer1 1](https://www.pdfsearch.io/img/ef152bb31747f13a0b973e37490d55e7.jpg) | Add to Reading ListSource URL: distcomp.ethz.chLanguage: English - Date: 2005-07-24 07:43:23
|
---|
115![A Scalable and Nearly Uniform Generator of SAT Witnesses? Supratik Chakraborty1 , Kuldeep S. Meel2 , and Moshe Y. Vardi2 1 arXiv:1304.1584v1 [cs.LO] 4 Apr 2013 A Scalable and Nearly Uniform Generator of SAT Witnesses? Supratik Chakraborty1 , Kuldeep S. Meel2 , and Moshe Y. Vardi2 1 arXiv:1304.1584v1 [cs.LO] 4 Apr 2013](https://www.pdfsearch.io/img/7b579d16cacffcccc01441cdfc18d26c.jpg) | Add to Reading ListSource URL: arxiv.orgLanguage: English - Date: 2013-04-07 20:21:28
|
---|
116![Theoretical Justification of Popular Link Prediction Heuristics Purnamrita Sarkar Carnegie Mellon University Theoretical Justification of Popular Link Prediction Heuristics Purnamrita Sarkar Carnegie Mellon University](https://www.pdfsearch.io/img/f189a9f0bee9b04331f94bb46e858765.jpg) | Add to Reading ListSource URL: www.cs.cmu.eduLanguage: English - Date: 2011-04-16 14:31:09
|
---|
117![Tight Bounds for Distributed Selection Fabian Kuhn Institute of Theoretical Computer Science ETH Zurich, Switzerland Tight Bounds for Distributed Selection Fabian Kuhn Institute of Theoretical Computer Science ETH Zurich, Switzerland](https://www.pdfsearch.io/img/2319d48b7746aa1b33e9e6ab0abda497.jpg) | Add to Reading ListSource URL: distcomp.ethz.chLanguage: English - Date: 2007-04-02 04:50:42
|
---|
118![How to Generate and Exchange Secrets (extended abstract) How to Generate and Exchange Secrets (extended abstract)](https://www.pdfsearch.io/img/7095c507b2f9762287395ab80f5cc9b4.jpg) | Add to Reading ListSource URL: www.csee.wvu.eduLanguage: English - Date: 2009-04-08 11:29:01
|
---|
119![Noncryptographic Selection Protocols (Extended Abstract) Uriel Feige Noncryptographic Selection Protocols (Extended Abstract) Uriel Feige](https://www.pdfsearch.io/img/2553bddb05198ad2219d09145321c70e.jpg) | Add to Reading ListSource URL: www.disco.ethz.chLanguage: English - Date: 2011-01-19 07:00:55
|
---|
120![ICM 2002 • Vol. I • 245^272 Mathematical Foundations of ICM 2002 • Vol. I • 245^272 Mathematical Foundations of](https://www.pdfsearch.io/img/d62286758261eb58e62314ed7f0e3634.jpg) | Add to Reading ListSource URL: www.mathunion.orgLanguage: English - Date: 2012-04-18 10:56:38
|
---|